Prediction bounds for case scheduling: interpret with caution.

نویسندگان

  • F Overdyk
  • P Rust
چکیده

To the Editor:-We read with interest the article by Zhou and Dexter on the use of prediction bounds to assist scheduling of add-on cases.‘ We acknowledge that the authors have addressed an important topic in operating-room efficiency; however, we have certain concerns as to the practical utility of the current version of this approach. Table 1 in their article supplies data on the quality of 5096, 8076, and 90% prediction bounds for the distribution-free and log-normal methods. where quality refers to the amount of bias existing in these estimates. We accept the conclusion of the authors that bias is adequately controlled by the log-normal method, although perhaps not by the distribution-free approach. Strum et al.’ have claimed that surgical durations may well follow the log-normal distribution. Nevertheless, large numbers of observations are needed to verify independently the log-normal goodness of fit, as Zhou and Dexter acknowledge. However, although unbiased estimators traditionally have been considered dKSirdbk, this property is not sufficient to ensure the usefulness of this statistical procedure. Similarly, the authors’ statement that “such prediction bounds can be calculated from only two previous cases,” while technically correct, does not guarantee this approach to he clinically useful. We examined this issue using case duration data obtained at our own institution and computed lognormal prediction bounds for knee arthroscopies performed by six surgeons, using the same formula as in the authors’ appendix. Table 1 contains computed prediction bounds with durations expressed in hours and minutes. The last column provides the SD of the logarithm of surgical duration. Surgeon S4, associated with the smallest s value, seems to perform this procedure very consistently, with a mere 21-min difference between his 50% and 90% prediction bounds. On the other hand, surgeon #6‘s predicted durations at 80% and 90% are extremely long because of the combination o f an elevated 50% value, a small sample size, and a large s value. Although these bounds are mathematically correct, the combination of these three factors produce prediction bounds that are clinically not useful. Small sample size is problematic not only because the t distribution is used, but also because of the (1 + l/n) factor in the prediction formula. To illustrate the effect of sample size, when we compute prediction bounds for surgeon #2 using only his last two cases instead of his previous 12 cases (#2b in table I ) , the prediction bounds revert to a much wider distribution. Furthermore, we observe that the prediction quantiles for surgeon #4 (n = 4) are tighter than those for surgeon #1 (n = 25) and that the value of the SU is also a very important consideration. Although one might be tempted to interpret the SD as a measure of a particular surgeon’s ability to work at a consistent rate, differences in SDs are far more likely to arise from random variability. In this context, such variability is known among statisticians to be substantial and must be considered dominant for smaller sample sizes. Although the authors are to be commended for advancing our understanding of efficient operating-room scheduling, we believe additional investigation is required before a practical implementation of log-normally distributed case durations can be recommended.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel B and B Algorithm for a Unrelated Parallel Machine Scheduling Problem to Minimize the Total Weighted Tardiness

This paper presents a scheduling problem with unrelated parallel machines and sequencedependent setup times that minimizes the total weighted tardiness. A new branch-and-bound (B and B) algorithm is designed incorporating the lower and upper bounding schemes and several dominance properties. The lower and upper bounds are derived through an assignment problem and the composite dispatching rule ...

متن کامل

A Simulated Annealing Algorithm for Multi Objective Flexible Job Shop Scheduling with Overlapping in Operations

In this paper, we considered solving approaches to flexible job shop problems. Makespan is not a good evaluation criterion with overlapping in operations assumption. Accordingly, in addition to makespan, we used total machine work loading time and critical machine work loading time as evaluation criteria. As overlapping in operations is a practical assumption in chemical, petrochemical, and gla...

متن کامل

CEAS - 832 Simple Performance Bounds for Multicore and Parallel Channel

A simple modification of existing divisible load scheduling algorithms, boosting link speed by M for M parallel channels per link, allows time optimal load scheduling and performance prediction for parallel channel systems. The situation for multicore models is more complex but can be handled by a substitution involving equivalent processor speed. These modifications yield upper bounds on such ...

متن کامل

Simple Performance Bounds for Multicore and Parallel Channel Systems

A simple modification of existing divisible load scheduling algorithms, boosting link speed by M for M parallel channels per link, allows time optimal load scheduling and performance prediction for parallel channel systems. The situation for multicore models is more complex but can be handled by a substitution involving equivalent processor speed. These modifications yield upper bounds on such ...

متن کامل

Net Present Value of Cash Flows in Single Machine and Flow Shop Scheduling Problems

While a great portion of the scheduling literature focuses on time-based criteria, the most important goal of management is maximizing the profitability of the firm. In this paper, the net preset value criterion is studied taking account of linear time-dependent cash flows in single machine and flow shop scheduling problems. First, a heuristic method is presented for the single machine scheduli...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Anesthesiology

دوره 91 2  شماره 

صفحات  -

تاریخ انتشار 1999